Computing Phrasal-signs in HPSG prior to Parsing
نویسندگان
چکیده
This paper describes techniques to compile lexical entries in HPSG (Pollard and Sag, 1987; Pollard and Sag, 1993)-style grammar into a set of nite state au-tomata. The states in automata are possible signs derived from lexical entries and contain information raised from the lexical entries. The automata are augmented with feature structures used by a partial unication routine and de-layed/frozen denite clause programs.
منابع مشابه
Integrated Shallow and Deep Parsing: TopP Meets HPSG
We present a novel, data-driven method for integrated shallow and deep parsing. Mediated by an XML-based multi-layer annotation architecture, we interleave a robust, but accurate stochastic topological field parser of German with a constraintbased HPSG parser. Our annotation-based method for dovetailing shallow and deep phrasal constraints is highly flexible, allowing targeted and fine-grained ...
متن کاملOn the notion ` Minor Category
This paper presents an HPSG based treatment of minor signs, i.e. words which cannot head a phrasal projection. In contrast to what is commonly assumed in PSG, I will argue that the minor signs do not belong to separate speech parts, but that all speech parts have both major and minor members. This claim is substantiated with evidence from the Dutch personal pronouns and the English determiners....
متن کاملParse disambiguation for a rich HPSG grammar
The fine-grained nature of the HPSG representations found in the Redwoods treebank raises novel issues in parse disambiguation relative to more traditional treebanks such as the Penn treebank, which have been the focus of most past work on probabilistic parsing (e.g., Charniak 1997; Collins 1997). The Redwoods treebank is much richer in the representations it makes available. Most similar to Pe...
متن کاملComputational semantics: linking language processing to applications
Minimal recursion semantics (MRS) is a framework for computational semantics that is suitable for parsing and generation and that can be implemented in typed feature structure formalisms. We discuss why, in general, a semantic representation with minimal structure is desirable and illustrate how a descriptively adequate representation with a nonrecursive structure may be achieved. MRS enables a...
متن کاملMinimal Recursion Semantics: An Introduction
Minimal recursion semantics (MRS) is a framework for computational semantics that is suitable for parsing and generation and that can be implemented in typed feature structure formalisms. We discuss why, in general, a semantic representation with minimal structure is desirable and illustrate how a descriptively adequate representation with a nonrecursive structure may be achieved. MRS enables a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996